Matrix Encryption Scheme

Simple Matrix Scheme for Encryption

Cryptanalysis of Simple Matrix Scheme for Encryption

Recently, Tao et al. presented a new simple and efficient multivariate pubic key encryption scheme based on matrix multiplication, which is called Simple Matrix Scheme or ABC. Using linearization equation attack, we propose a polynomial time algorithm, which directly recovers an equivalent private key from the public key of ABC. Furthermore, our attack can also be applied to the variants of ABC...

A note on Tensor Simple Matrix Encryption Scheme

The simple matrix encryption scheme (Tao-Diene-Tang-Ding, PQCrypto 2013) has a problem of decryption failures. Quite recently, Petzoldt-Ding-Wang (http://eprint.iacr. org/2016/010) proposed a new version of this scheme called the tensor simple matrix encryption scheme to remove decryption failures by using a tensor product of two small matrices as its secret key. However, it is much weaker than...

Eliminating Decryption Failures from the Simple Matrix Encryption Scheme

The SimpleMatrix encryption scheme as proposed by Tao et al. [16] is one of the very few existing approaches to create a secure and efficient encryption scheme on the basis of multivariate polynomials. However, in its basic version, decryption failures occur with non-negligible probability. Although this problem has been addressed in several papers [5,17], a general solution to it is still miss...

Semantic Encryption Transformation Scheme

We present a scheme to protect mobile code from malicious hosts. We propose a transformation scheme that changes the semantics of a program using pseudorandom I/O scrambling, conditional elimination, and encryption using numeric variables for changing programs into encrypted but executable form that yields a recoverable result. The goal of our transformation process is to prevent an attacker fr...